package com.search;

public class MaxPerformance {
	static int maxp = 0,minEfficiency = 0;
	int[] flag;
	public static void main(String[] args) {
		
	}
	 public int maxPerformance(int n, int[] speed, int[] efficiency, int k) {
		 	flag = new int[k + 1];
		 	int x = backTrack(speed,efficiency,k);
		 	return x;
	  }
	 public int backTrack(int[] speed, int[] efficiency, int k) {
		 if(k == 0) {
		 		return 0;
		 	}
		 if(flag[k] != 0) {
			 return flag[k];
		 }
		 else {
			 int x = backTrack(speed,efficiency,k-1);
			 int y = backTrack(speed,efficiency,k-1);
		 }
		 	
	        return maxp;
	 }
}
//           for(int i = 0;i < speed.length;i++) {
//				 int x = backTrack(speed,efficiency,k-1);
//				 int y = backTrack(speed,efficiency,k-1) + ;
//			 }